Incremental DFA Minimisation
نویسندگان
چکیده
We present a new incremental algorithm for minimising deterministic finite automata. It runs in quadratic time for any practical application and may be halted at any point, returning a partially minimised automaton. Hence, the algorithm may be applied to a given automaton at the same time as it is processing a string for acceptance. We also include some experimental comparative results.
منابع مشابه
On Minimising Automata with Errors
The problem of k-minimisation for a DFA M is the computation of a smallest DFAN (where the size |M | of a DFAM is the size of the domain of the transition function) such that L(M)4L(N) ⊆ Σ, which means that their recognized languages differ only on words of length less than k. The previously best algorithm, which runs in time O(|M | log n) where n is the number of states, is extended to DFAs wi...
متن کاملIncremental construction of minimal deterministic finite cover automata
We present a fast incremental algorithm for constructing minimal DFCA for a given language. Since it was shown that the minimal DFCA for a language L has less states than the minimal DFA for the same language L, this technique seems to be the best choice for incrementally building the automaton for a large language, especially when the number of states in the DFCA is significantly less than the...
متن کاملIncremental Construction of Compact Acyclic NFAs
This paper presents and analyzes an incremental algorithm for the construction of Acyclic Nondeterministic Finite-state Automata (NFA). Automata of this type are quite useful in computational linguistics, especially for storing lexicons. The proposed algorithm produces compact NFAs, i.e. NFAs that do not contain equivalent states. Unlike Deterministic Finite-state Automata (DFA), this property ...
متن کاملSemantical Expansion of Two-Level Boolean Formulas for Minimisation
Semantical expansion aims at boosting minimisation heuristics for Boolean formulas. It provides an easy way of deciding whether or not a given minterm, resp. clause, can be added safely to a formula in DNF, resp. CNF. We suggest to use incremental and complete SAT solvers and instances of UNSAT for these decisions, and report on some preliminary empirical results.
متن کاملA Polynominal Time Incremental Algorithm for Learning DFA
We present an efficient incremental algorithm for learning deterministic finite state automata (DFA) from labeled examples and membership queries. This algorithm is an extension of Angluin’s ID procedure to an incremental framework. The learning algorithm is intermittently provided with labeled examples and has access to a knowledgeable teacher capable of answering membership queries. The learn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- RAIRO - Theor. Inf. and Applic.
دوره 48 شماره
صفحات -
تاریخ انتشار 2010